Multi Party Computation Motivated by the Birthday Problem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-party Quantum Computation

We investigate definitions of and protocols for multi-party quantum computing in the scenario where the secret data are quantum systems. We work in the quantum information-theoretic model, where no assumptions are made on the computational power of the adversary. For the slightly weaker task of verifiable quantum secret sharing, we give a protocol which tolerates any t < n/4 cheating parties (o...

متن کامل

Outsourcing Multi-Party Computation

We initiate the study of secure multi-party computation (MPC) in a server-aided setting, where the parties have access to a single server that (1) does not have any input to the computation; (2) does not receive any output from the computation; but (3) has a vast (but bounded) amount of computational resources. In this setting, we are concerned with designing protocols that minimize the computa...

متن کامل

The birthday party.

They lived here, though, not in my exam room. “Eat!” Bahir commanded when we returned to the living room. It took me 3 servings to realize that clearing the plate indicated that I was still hungry and signaled Junah to heap it with more dumplings and date-and-sesame balls. I finally tried setting it down with a few forkfuls of food remaining, and my hosts nodded with satisfaction. Shortly after...

متن کامل

Unconditionally Secure Multi-Party Computation

The most general type of multi-party computation involves n participants. Participant i supplies private data xi and obtains an output function fi(x1, . . . , xn). The computation is said to be unconditionally secure if each participant can verify, with probability arbitrarily close to one, that every other participant obtains arbitrarily little information beyond their agreed output fi. We giv...

متن کامل

A Biologically Motivated Solution to the Cocktail Party Problem

We present a new approach to the cocktail party problem that uses a cortronic artificial neural network architecture (Hecht-Nielsen, 1998) as the front end of a speech processing system. Our approach is novel in three important respects. First, our method assumes and exploits detailed knowledge of the signals we wish to attend to in the cocktail party environment. Second, our goal is to provide...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Cybernetica

سال: 2019

ISSN: 0324-721X

DOI: 10.14232/actacyb.24.1.2019.4